Parallelizing Multiple Flow Accumulation Algorithm using CUDA and OpenACC

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelizing H.264 Motion Estimation Algorithm using CUDA

Motion estimation is currently the most computationally intensive portion of the H.264 encoding process. Previous attempts to parallelize this algorithm in CUDA 1 showed sizable speedups but sacrificed quality by ignoring the motion vector prediction (MVp). We demonstrate the viability of a hierarchical (pyramid) motion estimation algorithm in CUDA. This solution addresses the MVp problem while...

متن کامل

Parallelizing the Smith-Waterman Local Alignment Algorithm using CUDA

Given two strings S1 = pqaxabcstrqrtp and S2 = xyaxbacsl, the substrings axabcs in S1 and axbacs in S2 are very similar. The problem of finding similar substrings is the local alignment problem. Local alignment is extensively used in computational biology to find regions of similarity in different biological sequences. Similar genetic sequences are identified by computing the local alignment of...

متن کامل

Parallelizing flow-accumulation calculations on graphics processing units - From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm

As one of the important tasks in digital terrain analysis, the calculation of flow accumulations from gridded digital elevation models (DEMs) usually involves two steps in a real application: (1) using an iterative DEM preprocessing algorithm to remove the depressions and flat areas commonly contained in real DEMs, and (2) using a recursive flow-direction algorithm to calculate the flow accumul...

متن کامل

Parallelizing and Optimizing LIP-Canny Using NVIDIA CUDA

The Canny algorithm is a well known edge detector that is widely used in the previous processing stages in several algorithms related to computer vision. An alternative, the LIP-Canny algorithm, is based on a robust mathematical model closer to the human vision system, obtaining better results in terms of edge detection. In this work we describe LIP-Canny algorithm under the perspective from it...

متن کامل

Accelerating Phylogenetic Inference on GPUs: an OpenACC and CUDA comparison

Phylogenetic inference is used to derive a “tree of life” for a collection of species whose DNA sequences are known. While several software packages have already been developed to take advantage of GPUs to accelerate phylogenetic inference, they typically require significant changes to the original code, constraining code maintenance. Recently, the OpenACC API was proposed to minimize the progr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISPRS International Journal of Geo-Information

سال: 2019

ISSN: 2220-9964

DOI: 10.3390/ijgi8090386